Joining non-low C.E. sets with diagonally non-computable functions
نویسندگان
چکیده
We show that every non-low c.e. set joins all ∆2 diagonally noncomputable functions to ∅′. We give two proofs: a direct argument, and a proof using an analysis of functions that are DNC relative to an oracle, extending work by Day and Reimann. The latter proof is also presented in the language of Kolmogorov complexity.
منابع مشابه
Limit Computable Sets and Degrees
This paper will study sets and degrees containing sets that are determined as limits of computable approximations. By the Shoenfield Limit Lemma, the limit computable sets are precisely the degrees below ∅′. In particular, the paper will study limit computable sets by classifying them according to bounds to the number of changes to elements in various approximations of the sets. This leads to t...
متن کاملOn the Density of the Pseudo-isolated Degrees
A set A ! is computably enumerable (c.e. for short) if A can be listed e)ectively. Another way of de,ning c.e. sets is by computable approximations to their characteristic functions: A is c.e. if and only if there is a computable function f such that for all x: (1) fðx; 0Þ 1⁄4 0, (2) jfs : fðx; sÞ 61⁄4 fðx; sþ 1Þjg6 1, (3) AðxÞ 1⁄4 lims fðx; sÞ. The intuition is that we can change our guesses a...
متن کاملMartin-löf Reducibility and Cost Functions
Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e. set of the same ML-degree. We investigate the interplay between ML-reducibility and cost functions, which are used to both measure the number of changes in a computable approximation, and the type of null sets used to cap...
متن کاملImmunity and Non-Cupping for Closed Sets
We extend the notion of immunity to closed sets and to Π1 classes in particular in two ways: immunity meaning the corresponding tree has no infinite computable subset, and tree-immunity meaning it has no infinite computable subtree. We separate these notions from each other and that of being special, and show separating classes for computably inseparable c.e. sets are immune and perfect thin cl...
متن کاملWorking with Strong Reducibilities above Totally Ω-c.e. and Array Computable Degrees
We investigate the connections between the complexity of a c.e. set, as calibrated by its strength as an oracle for Turing computations of functions in the Ershov hierarchy, and how strong reducibilities allow us to compute such sets. For example, we prove that a c.e. degree is totally ω-c.e. iff every set in it is weak truth-table reducible to a hypersimple, or ranked, set. We also show that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 2013